./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_sync.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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_sync.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 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 06:20:57,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 06:20:57,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 06:20:57,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 06:20:57,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 06:20:57,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 06:20:57,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 06:20:57,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 06:20:57,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 06:20:57,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 06:20:57,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 06:20:57,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 06:20:57,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 06:20:57,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 06:20:57,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 06:20:57,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 06:20:57,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 06:20:57,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 06:20:57,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 06:20:57,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 06:20:57,087 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 06:20:57,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 06:20:57,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 06:20:57,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 06:20:57,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 06:20:57,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 06:20:57,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 06:20:57,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 06:20:57,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 06:20:57,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 06:20:57,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 06:20:57,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 06:20:57,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 06:20:57,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 06:20:57,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 06:20:57,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 06:20:57,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 06:20:57,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 06:20:57,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 06:20:57,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 06:20:57,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 06:20:57,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 06:20:57,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 06:20:57,147 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 06:20:57,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 06:20:57,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 06:20:57,148 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 06:20:57,149 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 06:20:57,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 06:20:57,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 06:20:57,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 06:20:57,150 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 06:20:57,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 06:20:57,152 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 06:20:57,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 06:20:57,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 06:20:57,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 06:20:57,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 06:20:57,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 06:20:57,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 06:20:57,161 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 06:20:57,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 06:20:57,161 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 06:20:57,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 06:20:57,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 06:20:57,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 06:20:57,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 06:20:57,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 06:20:57,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 06:20:57,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 06:20:57,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 06:20:57,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 06:20:57,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 06:20:57,164 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 06:20:57,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 06:20:57,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 06:20:57,164 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 -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2022-07-21 06:20:57,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 06:20:57,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 06:20:57,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 06:20:57,488 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 06:20:57,489 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 06:20:57,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2022-07-21 06:20:57,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb759b517/5024ce6c47a346849f4222bffbaa7b4f/FLAG1829b6717 [2022-07-21 06:20:58,227 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 06:20:58,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2022-07-21 06:20:58,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb759b517/5024ce6c47a346849f4222bffbaa7b4f/FLAG1829b6717 [2022-07-21 06:20:58,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb759b517/5024ce6c47a346849f4222bffbaa7b4f [2022-07-21 06:20:58,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 06:20:58,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 06:20:58,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 06:20:58,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 06:20:58,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 06:20:58,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 06:20:58" (1/1) ... [2022-07-21 06:20:58,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27803881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:58, skipping insertion in model container [2022-07-21 06:20:58,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 06:20:58" (1/1) ... [2022-07-21 06:20:58,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 06:20:58,654 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 06:20:59,070 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_sync.i[34698,34711] [2022-07-21 06:20:59,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 06:20:59,209 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 06:20:59,250 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_sync.i[34698,34711] [2022-07-21 06:20:59,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 06:20:59,392 INFO L208 MainTranslator]: Completed translation [2022-07-21 06:20:59,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59 WrapperNode [2022-07-21 06:20:59,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 06:20:59,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 06:20:59,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 06:20:59,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 06:20:59,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59" (1/1) ... [2022-07-21 06:20:59,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59" (1/1) ... [2022-07-21 06:20:59,493 INFO L137 Inliner]: procedures = 245, calls = 244, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 544 [2022-07-21 06:20:59,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 06:20:59,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 06:20:59,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 06:20:59,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 06:20:59,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59" (1/1) ... [2022-07-21 06:20:59,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59" (1/1) ... [2022-07-21 06:20:59,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59" (1/1) ... [2022-07-21 06:20:59,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59" (1/1) ... [2022-07-21 06:20:59,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59" (1/1) ... [2022-07-21 06:20:59,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59" (1/1) ... [2022-07-21 06:20:59,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59" (1/1) ... [2022-07-21 06:20:59,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 06:20:59,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 06:20:59,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 06:20:59,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 06:20:59,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59" (1/1) ... [2022-07-21 06:20:59,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 06:20:59,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:20:59,598 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-21 06:20:59,603 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-21 06:20:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 06:20:59,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 06:20:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 06:20:59,638 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2022-07-21 06:20:59,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2022-07-21 06:20:59,639 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-21 06:20:59,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-21 06:20:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 06:20:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 06:20:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 06:20:59,641 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-21 06:20:59,641 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-21 06:20:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 06:20:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2022-07-21 06:20:59,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2022-07-21 06:20:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 06:20:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 06:20:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 06:20:59,643 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-21 06:20:59,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-21 06:20:59,643 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2022-07-21 06:20:59,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2022-07-21 06:20:59,643 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-21 06:20:59,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-21 06:20:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-21 06:20:59,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-21 06:20:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-21 06:20:59,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-21 06:20:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 06:20:59,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 06:20:59,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 06:20:59,863 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 06:20:59,865 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 06:21:00,271 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !(0 != ~__CS_ret~0 % 256); [2022-07-21 06:21:00,271 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-21 06:21:00,271 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0 != ~__CS_ret~0 % 256); [2022-07-21 06:21:00,272 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-21 06:21:00,272 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: SUMMARY for call __CS_cs(); srcloc: null [2022-07-21 06:21:00,272 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-21 06:21:00,272 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-21 06:21:02,588 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 06:21:02,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 06:21:02,596 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-21 06:21:02,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:21:02 BoogieIcfgContainer [2022-07-21 06:21:02,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 06:21:02,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 06:21:02,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 06:21:02,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 06:21:02,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 06:20:58" (1/3) ... [2022-07-21 06:21:02,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b54585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 06:21:02, skipping insertion in model container [2022-07-21 06:21:02,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 06:20:59" (2/3) ... [2022-07-21 06:21:02,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b54585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 06:21:02, skipping insertion in model container [2022-07-21 06:21:02,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 06:21:02" (3/3) ... [2022-07-21 06:21:02,605 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2022-07-21 06:21:02,622 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 06:21:02,622 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 06:21:02,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 06:21:02,674 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@3dc7951c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b75a209 [2022-07-21 06:21:02,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 06:21:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-21 06:21:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 06:21:02,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:02,695 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 06:21:02,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1902090431, now seen corresponding path program 1 times [2022-07-21 06:21:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:02,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132394302] [2022-07-21 06:21:02,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:02,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 06:21:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 06:21:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:21:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:21:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 06:21:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 06:21:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 06:21:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 06:21:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 06:21:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 06:21:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 06:21:03,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:03,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132394302] [2022-07-21 06:21:03,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132394302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:21:03,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:21:03,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 06:21:03,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524257678] [2022-07-21 06:21:03,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:21:03,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 06:21:03,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:03,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 06:21:03,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:21:03,295 INFO L87 Difference]: Start difference. First operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:21:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:03,392 INFO L93 Difference]: Finished difference Result 390 states and 641 transitions. [2022-07-21 06:21:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 06:21:03,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-07-21 06:21:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:03,406 INFO L225 Difference]: With dead ends: 390 [2022-07-21 06:21:03,410 INFO L226 Difference]: Without dead ends: 194 [2022-07-21 06:21:03,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-21 06:21:03,426 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 4 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 568 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-21 06:21:03,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 568 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:21:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-21 06:21:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2022-07-21 06:21:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 125 states have (on average 1.4) internal successors, (175), 125 states have internal predecessors, (175), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-21 06:21:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 285 transitions. [2022-07-21 06:21:03,520 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 285 transitions. Word has length 72 [2022-07-21 06:21:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:03,522 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 285 transitions. [2022-07-21 06:21:03,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:21:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 285 transitions. [2022-07-21 06:21:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-21 06:21:03,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:03,535 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 06:21:03,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 06:21:03,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:03,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1569921272, now seen corresponding path program 1 times [2022-07-21 06:21:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:03,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38457228] [2022-07-21 06:21:03,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:03,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 06:21:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 06:21:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 06:21:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 06:21:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 06:21:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 06:21:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:21:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 06:21:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 06:21:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 06:21:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 06:21:03,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:03,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38457228] [2022-07-21 06:21:03,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38457228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:21:03,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 06:21:03,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 06:21:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249105220] [2022-07-21 06:21:03,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:21:03,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 06:21:03,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 06:21:03,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 06:21:03,872 INFO L87 Difference]: Start difference. First operand 191 states and 285 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:21:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:03,933 INFO L93 Difference]: Finished difference Result 381 states and 570 transitions. [2022-07-21 06:21:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 06:21:03,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-07-21 06:21:03,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:03,942 INFO L225 Difference]: With dead ends: 381 [2022-07-21 06:21:03,942 INFO L226 Difference]: Without dead ends: 193 [2022-07-21 06:21:03,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-21 06:21:03,948 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 561 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-21 06:21:03,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 561 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:21:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-21 06:21:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2022-07-21 06:21:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-21 06:21:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2022-07-21 06:21:03,981 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 75 [2022-07-21 06:21:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:03,982 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2022-07-21 06:21:03,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:21:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2022-07-21 06:21:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-21 06:21:03,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:03,986 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 06:21:03,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 06:21:03,988 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:03,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash 217866074, now seen corresponding path program 1 times [2022-07-21 06:21:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:03,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391037070] [2022-07-21 06:21:03,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 06:21:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 06:21:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 06:21:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 06:21:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 06:21:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 06:21:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 06:21:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 06:21:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 06:21:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 06:21:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 06:21:04,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:04,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391037070] [2022-07-21 06:21:04,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391037070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:04,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376461435] [2022-07-21 06:21:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:04,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:04,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:04,251 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-21 06:21:04,298 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-21 06:21:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:04,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 1763 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 06:21:04,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 06:21:04,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 06:21:05,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376461435] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:21:05,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:21:05,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-21 06:21:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972251764] [2022-07-21 06:21:05,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:05,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 06:21:05,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:05,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 06:21:05,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-21 06:21:05,035 INFO L87 Difference]: Start difference. First operand 192 states and 286 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-21 06:21:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:05,103 INFO L93 Difference]: Finished difference Result 385 states and 575 transitions. [2022-07-21 06:21:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 06:21:05,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-07-21 06:21:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:05,107 INFO L225 Difference]: With dead ends: 385 [2022-07-21 06:21:05,108 INFO L226 Difference]: Without dead ends: 196 [2022-07-21 06:21:05,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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-21 06:21:05,116 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 3 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:05,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1119 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:21:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-21 06:21:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-21 06:21:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-21 06:21:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2022-07-21 06:21:05,138 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 77 [2022-07-21 06:21:05,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:05,139 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2022-07-21 06:21:05,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-21 06:21:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2022-07-21 06:21:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-21 06:21:05,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:05,141 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-21 06:21:05,173 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-21 06:21:05,367 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-21 06:21:05,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:05,368 INFO L85 PathProgramCache]: Analyzing trace with hash 971561630, now seen corresponding path program 2 times [2022-07-21 06:21:05,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:05,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245305696] [2022-07-21 06:21:05,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:05,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:05,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 06:21:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:05,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 06:21:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 06:21:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:05,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 06:21:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 06:21:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:05,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:21:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:05,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 06:21:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 06:21:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:05,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 06:21:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 06:21:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-07-21 06:21:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245305696] [2022-07-21 06:21:05,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245305696] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:05,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144732005] [2022-07-21 06:21:05,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 06:21:05,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:05,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:05,683 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-21 06:21:05,685 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-21 06:21:06,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 06:21:06,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 06:21:06,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 06:21:06,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 06:21:06,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:21:06,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144732005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:21:06,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 06:21:06,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-21 06:21:06,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93350712] [2022-07-21 06:21:06,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:21:06,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 06:21:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:06,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 06:21:06,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 06:21:06,678 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:21:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:06,715 INFO L93 Difference]: Finished difference Result 377 states and 570 transitions. [2022-07-21 06:21:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 06:21:06,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-07-21 06:21:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:06,720 INFO L225 Difference]: With dead ends: 377 [2022-07-21 06:21:06,720 INFO L226 Difference]: Without dead ends: 351 [2022-07-21 06:21:06,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 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-21 06:21:06,721 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 230 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:06,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1057 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:21:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-21 06:21:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2022-07-21 06:21:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 230 states have internal predecessors, (325), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2022-07-21 06:21:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 531 transitions. [2022-07-21 06:21:06,744 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 531 transitions. Word has length 81 [2022-07-21 06:21:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:06,745 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 531 transitions. [2022-07-21 06:21:06,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-21 06:21:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 531 transitions. [2022-07-21 06:21:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-21 06:21:06,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:06,749 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-21 06:21:06,781 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-21 06:21:06,963 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-21 06:21:06,963 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1383247446, now seen corresponding path program 1 times [2022-07-21 06:21:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:06,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994671774] [2022-07-21 06:21:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:06,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 06:21:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:21:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:21:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:21:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 06:21:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 06:21:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 06:21:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 06:21:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 06:21:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 06:21:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 06:21:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 06:21:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 06:21:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 06:21:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 06:21:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 06:21:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-21 06:21:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:07,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994671774] [2022-07-21 06:21:07,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994671774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:07,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356556457] [2022-07-21 06:21:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:07,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:07,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:07,379 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-21 06:21:07,381 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-21 06:21:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:08,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 2184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 06:21:08,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-21 06:21:08,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-07-21 06:21:08,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356556457] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:21:08,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:21:08,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-07-21 06:21:08,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622235509] [2022-07-21 06:21:08,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:08,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 06:21:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:08,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 06:21:08,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-21 06:21:08,462 INFO L87 Difference]: Start difference. First operand 350 states and 531 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-21 06:21:10,517 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-21 06:21:12,536 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-21 06:21:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:13,283 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2022-07-21 06:21:13,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 06:21:13,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 183 [2022-07-21 06:21:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:13,286 INFO L225 Difference]: With dead ends: 719 [2022-07-21 06:21:13,286 INFO L226 Difference]: Without dead ends: 381 [2022-07-21 06:21:13,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-21 06:21:13,289 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 108 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 175 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:13,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 929 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 556 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-07-21 06:21:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-21 06:21:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2022-07-21 06:21:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 241 states have (on average 1.3983402489626555) internal successors, (337), 243 states have internal predecessors, (337), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2022-07-21 06:21:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 547 transitions. [2022-07-21 06:21:13,313 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 547 transitions. Word has length 183 [2022-07-21 06:21:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:13,314 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 547 transitions. [2022-07-21 06:21:13,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-21 06:21:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 547 transitions. [2022-07-21 06:21:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-21 06:21:13,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:13,318 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-21 06:21:13,351 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-21 06:21:13,532 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-21 06:21:13,532 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:13,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash -945252521, now seen corresponding path program 2 times [2022-07-21 06:21:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:13,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512633192] [2022-07-21 06:21:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:13,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 06:21:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:21:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:21:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:21:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 06:21:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 06:21:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 06:21:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 06:21:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 06:21:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 06:21:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 06:21:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 06:21:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 06:21:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 06:21:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-21 06:21:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 06:21:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2022-07-21 06:21:29,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:29,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512633192] [2022-07-21 06:21:29,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512633192] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:29,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271055239] [2022-07-21 06:21:29,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 06:21:29,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:29,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:29,351 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-21 06:21:29,352 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-21 06:21:30,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 06:21:30,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 06:21:30,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 06:21:30,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-07-21 06:21:30,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:21:30,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271055239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:21:30,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 06:21:30,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-21 06:21:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107257338] [2022-07-21 06:21:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:21:30,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 06:21:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:30,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 06:21:30,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-21 06:21:30,411 INFO L87 Difference]: Start difference. First operand 363 states and 547 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-21 06:21:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:30,435 INFO L93 Difference]: Finished difference Result 695 states and 1053 transitions. [2022-07-21 06:21:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 06:21:30,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 192 [2022-07-21 06:21:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:30,439 INFO L225 Difference]: With dead ends: 695 [2022-07-21 06:21:30,439 INFO L226 Difference]: Without dead ends: 363 [2022-07-21 06:21:30,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-21 06:21:30,442 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 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-21 06:21:30,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 06:21:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-21 06:21:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-07-21 06:21:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 243 states have internal predecessors, (336), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2022-07-21 06:21:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 546 transitions. [2022-07-21 06:21:30,485 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 546 transitions. Word has length 192 [2022-07-21 06:21:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:30,485 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 546 transitions. [2022-07-21 06:21:30,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-21 06:21:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 546 transitions. [2022-07-21 06:21:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-21 06:21:30,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:30,490 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 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] [2022-07-21 06:21:30,520 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-21 06:21:30,703 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-21 06:21:30,703 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:30,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash 342116215, now seen corresponding path program 1 times [2022-07-21 06:21:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:30,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884431258] [2022-07-21 06:21:30,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:30,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:21:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 06:21:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:21:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:21:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:21:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 06:21:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 06:21:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 06:21:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 06:21:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 06:21:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 06:21:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 06:21:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 06:21:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 06:21:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 06:21:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-21 06:21:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-21 06:21:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-21 06:21:31,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:31,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884431258] [2022-07-21 06:21:31,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884431258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:31,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52688327] [2022-07-21 06:21:31,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:31,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:31,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:31,348 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-21 06:21:31,350 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-21 06:21:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:32,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 2532 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 06:21:32,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:32,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-21 06:21:32,643 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 06:21:32,737 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 11 treesize of output 7 [2022-07-21 06:21:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 400 proven. 5 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2022-07-21 06:21:32,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:21:32,833 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 12 treesize of output 8 [2022-07-21 06:21:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-07-21 06:21:33,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52688327] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:21:33,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:21:33,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-07-21 06:21:33,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789037136] [2022-07-21 06:21:33,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:21:33,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 06:21:33,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:33,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 06:21:33,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-21 06:21:33,051 INFO L87 Difference]: Start difference. First operand 363 states and 546 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) [2022-07-21 06:21:35,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:21:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:37,391 INFO L93 Difference]: Finished difference Result 845 states and 1305 transitions. [2022-07-21 06:21:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 06:21:37,392 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) Word has length 220 [2022-07-21 06:21:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:37,398 INFO L225 Difference]: With dead ends: 845 [2022-07-21 06:21:37,398 INFO L226 Difference]: Without dead ends: 815 [2022-07-21 06:21:37,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2022-07-21 06:21:37,402 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 673 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 663 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:37,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1126 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 1619 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-07-21 06:21:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2022-07-21 06:21:37,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 754. [2022-07-21 06:21:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 489 states have (on average 1.4110429447852761) internal successors, (690), 496 states have internal predecessors, (690), 215 states have call successors, (215), 40 states have call predecessors, (215), 49 states have return successors, (265), 217 states have call predecessors, (265), 215 states have call successors, (265) [2022-07-21 06:21:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1170 transitions. [2022-07-21 06:21:37,462 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1170 transitions. Word has length 220 [2022-07-21 06:21:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:37,462 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 1170 transitions. [2022-07-21 06:21:37,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 8 states have internal predecessors, (108), 8 states have call successors, (41), 8 states have call predecessors, (41), 6 states have return successors, (39), 8 states have call predecessors, (39), 8 states have call successors, (39) [2022-07-21 06:21:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1170 transitions. [2022-07-21 06:21:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-21 06:21:37,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:37,469 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-21 06:21:37,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 06:21:37,685 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-21 06:21:37,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:37,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash -26567542, now seen corresponding path program 1 times [2022-07-21 06:21:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:37,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013867066] [2022-07-21 06:21:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:43,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:21:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:43,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:43,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:43,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:43,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 06:21:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:21:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:21:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:21:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 06:21:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 06:21:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 06:21:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 06:21:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 06:21:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 06:21:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 06:21:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 06:21:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 06:21:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-21 06:21:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 06:21:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-21 06:21:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2022-07-21 06:21:44,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:44,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013867066] [2022-07-21 06:21:44,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013867066] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:44,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252075631] [2022-07-21 06:21:44,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:44,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:44,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:44,231 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-21 06:21:44,233 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-21 06:21:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:45,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 2496 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 06:21:45,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2022-07-21 06:21:45,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:21:45,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252075631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:21:45,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 06:21:45,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2022-07-21 06:21:45,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102950381] [2022-07-21 06:21:45,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:21:45,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 06:21:45,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:45,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 06:21:45,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-21 06:21:45,687 INFO L87 Difference]: Start difference. First operand 754 states and 1170 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-21 06:21:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:46,453 INFO L93 Difference]: Finished difference Result 1731 states and 2851 transitions. [2022-07-21 06:21:46,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 06:21:46,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) Word has length 221 [2022-07-21 06:21:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:46,466 INFO L225 Difference]: With dead ends: 1731 [2022-07-21 06:21:46,466 INFO L226 Difference]: Without dead ends: 1001 [2022-07-21 06:21:46,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-21 06:21:46,473 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 418 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:46,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 497 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 06:21:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-07-21 06:21:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 963. [2022-07-21 06:21:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 676 states have (on average 1.3032544378698225) internal successors, (881), 574 states have internal predecessors, (881), 225 states have call successors, (225), 41 states have call predecessors, (225), 61 states have return successors, (412), 347 states have call predecessors, (412), 225 states have call successors, (412) [2022-07-21 06:21:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1518 transitions. [2022-07-21 06:21:46,572 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1518 transitions. Word has length 221 [2022-07-21 06:21:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:46,573 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1518 transitions. [2022-07-21 06:21:46,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-21 06:21:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1518 transitions. [2022-07-21 06:21:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-21 06:21:46,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:46,579 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 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] [2022-07-21 06:21:46,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 06:21:46,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:46,795 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:46,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2076186120, now seen corresponding path program 1 times [2022-07-21 06:21:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:46,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139478774] [2022-07-21 06:21:46,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:46,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:21:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 06:21:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:21:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:21:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:21:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 06:21:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 06:21:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 06:21:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 06:21:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 06:21:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 06:21:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 06:21:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 06:21:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 06:21:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-21 06:21:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 06:21:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-21 06:21:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-21 06:21:47,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:47,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139478774] [2022-07-21 06:21:47,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139478774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:47,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832429951] [2022-07-21 06:21:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:47,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:47,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:47,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:21:47,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 06:21:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:48,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 2471 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 06:21:48,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:48,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 06:21:48,455 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-21 06:21:48,478 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 11 treesize of output 7 [2022-07-21 06:21:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2022-07-21 06:21:48,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:21:48,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832429951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:21:48,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 06:21:48,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-21 06:21:48,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498187907] [2022-07-21 06:21:48,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:21:48,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 06:21:48,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:48,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 06:21:48,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 06:21:48,491 INFO L87 Difference]: Start difference. First operand 963 states and 1518 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-21 06:21:48,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:21:48,668 INFO L93 Difference]: Finished difference Result 1940 states and 3040 transitions. [2022-07-21 06:21:48,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 06:21:48,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 221 [2022-07-21 06:21:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:21:48,680 INFO L225 Difference]: With dead ends: 1940 [2022-07-21 06:21:48,680 INFO L226 Difference]: Without dead ends: 1017 [2022-07-21 06:21:48,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-21 06:21:48,688 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 301 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 06:21:48,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 965 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 06:21:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2022-07-21 06:21:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 975. [2022-07-21 06:21:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 684 states have (on average 1.2997076023391814) internal successors, (889), 586 states have internal predecessors, (889), 225 states have call successors, (225), 41 states have call predecessors, (225), 65 states have return successors, (418), 347 states have call predecessors, (418), 225 states have call successors, (418) [2022-07-21 06:21:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1532 transitions. [2022-07-21 06:21:48,818 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1532 transitions. Word has length 221 [2022-07-21 06:21:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:21:48,819 INFO L495 AbstractCegarLoop]: Abstraction has 975 states and 1532 transitions. [2022-07-21 06:21:48,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-21 06:21:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1532 transitions. [2022-07-21 06:21:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-21 06:21:48,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:21:48,825 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-21 06:21:48,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-21 06:21:49,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:49,049 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:21:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:21:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1342111146, now seen corresponding path program 1 times [2022-07-21 06:21:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:21:49,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383015148] [2022-07-21 06:21:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:21:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:21:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:21:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 06:21:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:21:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:21:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 06:21:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 06:21:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 06:21:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 06:21:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:21:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:21:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 06:21:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 06:21:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 06:21:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 06:21:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 06:21:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 06:21:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 06:21:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 06:21:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-21 06:21:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-21 06:21:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2022-07-21 06:21:57,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:21:57,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383015148] [2022-07-21 06:21:57,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383015148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:21:57,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802999140] [2022-07-21 06:21:57,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:21:57,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:21:57,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:21:57,623 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:21:57,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 06:21:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:21:58,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 2499 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 06:21:58,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:21:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2022-07-21 06:21:59,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:21:59,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802999140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:21:59,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 06:21:59,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2022-07-21 06:21:59,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045945297] [2022-07-21 06:21:59,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:21:59,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 06:21:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:21:59,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 06:21:59,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-21 06:21:59,064 INFO L87 Difference]: Start difference. First operand 975 states and 1532 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-21 06:22:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:00,698 INFO L93 Difference]: Finished difference Result 2599 states and 4124 transitions. [2022-07-21 06:22:00,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 06:22:00,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 220 [2022-07-21 06:22:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:00,712 INFO L225 Difference]: With dead ends: 2599 [2022-07-21 06:22:00,712 INFO L226 Difference]: Without dead ends: 1648 [2022-07-21 06:22:00,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-07-21 06:22:00,722 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 406 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:00,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1064 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-21 06:22:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-07-21 06:22:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1440. [2022-07-21 06:22:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 989 states have (on average 1.2810920121334681) internal successors, (1267), 899 states have internal predecessors, (1267), 342 states have call successors, (342), 63 states have call predecessors, (342), 108 states have return successors, (648), 477 states have call predecessors, (648), 342 states have call successors, (648) [2022-07-21 06:22:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2257 transitions. [2022-07-21 06:22:00,876 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2257 transitions. Word has length 220 [2022-07-21 06:22:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:00,877 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 2257 transitions. [2022-07-21 06:22:00,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-07-21 06:22:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2257 transitions. [2022-07-21 06:22:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-21 06:22:00,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:00,884 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-21 06:22:00,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:01,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 06:22:01,112 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash 871035319, now seen corresponding path program 1 times [2022-07-21 06:22:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:22:01,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394984766] [2022-07-21 06:22:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:22:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:22:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:22:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 06:22:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:22:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:22:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:22:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 06:22:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 06:22:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 06:22:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 06:22:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 06:22:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 06:22:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 06:22:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 06:22:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 06:22:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 06:22:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-21 06:22:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 06:22:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-21 06:22:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2022-07-21 06:22:15,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:22:15,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394984766] [2022-07-21 06:22:15,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394984766] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:22:15,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554067912] [2022-07-21 06:22:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:15,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:22:15,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:22:15,862 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:22:15,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 06:22:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:17,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-21 06:22:17,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:17,672 INFO L356 Elim1Store]: treesize reduction 144, result has 14.8 percent of original size [2022-07-21 06:22:17,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 96 treesize of output 106 [2022-07-21 06:22:17,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2022-07-21 06:22:18,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:22:18,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:22:18,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:22:19,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-07-21 06:22:19,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 28 [2022-07-21 06:22:19,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:22:19,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:22:19,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-21 06:22:19,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:22:19,979 INFO L356 Elim1Store]: treesize reduction 315, result has 24.1 percent of original size [2022-07-21 06:22:19,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 1440 treesize of output 526 [2022-07-21 06:22:20,015 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-21 06:22:20,015 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 16 treesize of output 20 [2022-07-21 06:22:20,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-21 06:22:20,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 06:22:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 185 proven. 33 refuted. 0 times theorem prover too weak. 686 trivial. 0 not checked. [2022-07-21 06:22:20,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:22:20,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#num~0.offset| Int) (v_ArrVal_19063 (Array Int Int)) (v_ArrVal_19051 (Array Int Int)) (v_ArrVal_19062 (Array Int Int)) (v_ArrVal_19060 (Array Int Int)) (v_ArrVal_19066 (Array Int Int)) (v_ArrVal_19054 (Array Int Int)) (v_ArrVal_19048 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store |c_#memory_int| |c_~#__CS_thread_status~0.base| v_ArrVal_19060) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19048))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19066) |c_~#empty~0.base| v_ArrVal_19063) |c_~#full~0.base| v_ArrVal_19054) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19051) |c_~#__CS_thread_status~0.base| v_ArrVal_19062) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:22:20,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#num~0.offset| Int) (v_ArrVal_19063 (Array Int Int)) (v_ArrVal_19051 (Array Int Int)) (v_ArrVal_19062 (Array Int Int)) (v_ArrVal_19060 (Array Int Int)) (v_ArrVal_19044 (Array Int Int)) (v_ArrVal_19066 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19054 (Array Int Int)) (v_ArrVal_19048 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19044) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19043) |c_~#__CS_thread_status~0.base| v_ArrVal_19060) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19048))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19066) |c_~#empty~0.base| v_ArrVal_19063) |c_~#full~0.base| v_ArrVal_19054) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19051) |c_~#__CS_thread_status~0.base| v_ArrVal_19062) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:22:20,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19041 (Array Int Int)) (v_ArrVal_19063 (Array Int Int)) (v_ArrVal_19051 (Array Int Int)) (v_ArrVal_19062 (Array Int Int)) (v_ArrVal_19060 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19044 (Array Int Int)) (v_ArrVal_19066 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19054 (Array Int Int)) (v_ArrVal_19042 (Array Int Int)) (v_ArrVal_19048 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19041) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19042) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19044) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19043) |c_~#__CS_thread_status~0.base| v_ArrVal_19060) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19048))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19066) |c_~#empty~0.base| v_ArrVal_19063) |c_~#full~0.base| v_ArrVal_19054) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19051) |c_~#__CS_thread_status~0.base| v_ArrVal_19062) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:22:20,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19041 (Array Int Int)) (v_ArrVal_19063 (Array Int Int)) (v_ArrVal_19040 (Array Int Int)) (v_ArrVal_19051 (Array Int Int)) (v_ArrVal_19062 (Array Int Int)) (v_ArrVal_19060 (Array Int Int)) (|~#num~0.offset| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19044 (Array Int Int)) (v_ArrVal_19066 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19054 (Array Int Int)) (v_ArrVal_19042 (Array Int Int)) (v_ArrVal_19048 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19040) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19041) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19042) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19044) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19043) |c_~#__CS_thread_status~0.base| v_ArrVal_19060) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19048))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19066) |c_~#empty~0.base| v_ArrVal_19063) |c_~#full~0.base| v_ArrVal_19054) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19051) |c_~#__CS_thread_status~0.base| v_ArrVal_19062) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:22:20,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19041 (Array Int Int)) (v_ArrVal_19063 (Array Int Int)) (v_ArrVal_19040 (Array Int Int)) (v_ArrVal_19051 (Array Int Int)) (v_ArrVal_19062 (Array Int Int)) (v_ArrVal_19060 (Array Int Int)) (|~#num~0.offset| Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_#t~nondet78#1| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19044 (Array Int Int)) (v_ArrVal_19066 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19054 (Array Int Int)) (v_ArrVal_19042 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19048 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19035 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet78#1|)) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19040) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19041) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19042) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19044) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19043) |c_~#__CS_thread_status~0.base| v_ArrVal_19060) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19048))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19066) |c_~#empty~0.base| v_ArrVal_19063) |c_~#full~0.base| v_ArrVal_19054) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19051) |c_~#__CS_thread_status~0.base| v_ArrVal_19062) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:22:21,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19041 (Array Int Int)) (v_ArrVal_19063 (Array Int Int)) (v_ArrVal_19040 (Array Int Int)) (v_ArrVal_19051 (Array Int Int)) (v_ArrVal_19062 (Array Int Int)) (v_ArrVal_19060 (Array Int Int)) (|~#num~0.offset| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet78#1| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19044 (Array Int Int)) (v_ArrVal_19066 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19054 (Array Int Int)) (v_ArrVal_19042 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19048 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19035 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet78#1|))) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19040) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19041) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19042) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19044) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19043) |c_~#__CS_thread_status~0.base| v_ArrVal_19060) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19048))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19066) |c_~#empty~0.base| v_ArrVal_19063) |c_~#full~0.base| v_ArrVal_19054) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19051) |c_~#__CS_thread_status~0.base| v_ArrVal_19062) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:22:21,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19051 (Array Int Int)) (|~#num~0.offset| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19054 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19041 (Array Int Int)) (v_ArrVal_19063 (Array Int Int)) (v_ArrVal_19040 (Array Int Int)) (v_ArrVal_19062 (Array Int Int)) (v_ArrVal_19060 (Array Int Int)) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet78#1| Int) (v_ArrVal_19044 (Array Int Int)) (v_ArrVal_19066 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19042 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19048 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int)) (not (= 1 (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet78#1|))) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19040) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19041) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19042) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19044) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19043) |c_~#__CS_thread_status~0.base| v_ArrVal_19060) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19048))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19066) |c_~#empty~0.base| v_ArrVal_19063) |c_~#full~0.base| v_ArrVal_19054) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19051) |c_~#__CS_thread_status~0.base| v_ArrVal_19062) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256)))) is different from false [2022-07-21 06:22:21,139 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19051 (Array Int Int)) (|~#num~0.offset| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19054 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19041 (Array Int Int)) (v_ArrVal_19063 (Array Int Int)) (v_ArrVal_19040 (Array Int Int)) (v_ArrVal_19062 (Array Int Int)) (v_ArrVal_19060 (Array Int Int)) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet78#1| Int) (v_ArrVal_19044 (Array Int Int)) (v_ArrVal_19066 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19042 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19048 (Array Int Int)) (v_ArrVal_19025 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19024 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19024) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19025) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet78#1|))) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19040) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19041) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19042) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19044) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19043) |c_~#__CS_thread_status~0.base| v_ArrVal_19060) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19048))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19066) |c_~#empty~0.base| v_ArrVal_19063) |c_~#full~0.base| v_ArrVal_19054) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19051) |c_~#__CS_thread_status~0.base| v_ArrVal_19062) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:22:21,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_19051 (Array Int Int)) (|~#num~0.offset| Int) (|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_19039 (Array Int Int)) (v_ArrVal_19033 (Array Int Int)) (v_ArrVal_19054 (Array Int Int)) (v_ArrVal_19037 (Array Int Int)) (v_ArrVal_19035 (Array Int Int)) (v_ArrVal_19041 (Array Int Int)) (v_ArrVal_19063 (Array Int Int)) (v_ArrVal_19040 (Array Int Int)) (v_ArrVal_19062 (Array Int Int)) (v_ArrVal_19060 (Array Int Int)) (v_ArrVal_19029 (Array Int Int)) (v_ArrVal_19028 (Array Int Int)) (|ULTIMATE.start_main_#t~nondet78#1| Int) (v_ArrVal_19023 (Array Int Int)) (v_ArrVal_19022 (Array Int Int)) (v_ArrVal_19044 (Array Int Int)) (v_ArrVal_19066 (Array Int Int)) (v_ArrVal_19021 (Array Int Int)) (v_ArrVal_19043 (Array Int Int)) (v_ArrVal_19020 (Array Int Int)) (v_ArrVal_19042 (Array Int Int)) (v_ArrVal_19027 (Array Int Int)) (v_ArrVal_19026 (Array Int Int)) (v_ArrVal_19048 (Array Int Int)) (v_ArrVal_19025 (Array Int Int)) (|ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| Int) (v_ArrVal_19024 (Array Int Int))) (not (= (mod (select (select (store (store (store (store (store (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (let ((.cse1 (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| v_ArrVal_19020) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19023) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19021) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19022) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19024) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19025) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19026) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19027) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19029) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19028))) (store .cse1 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet78#1|))) |c_ULTIMATE.start_main_~#__CS_cp_m~0#1.base| v_ArrVal_19037) |c_ULTIMATE.start_main_~#__CS_cp_empty~0#1.base| v_ArrVal_19033) |c_ULTIMATE.start_main_~#__CS_cp_full~0#1.base| v_ArrVal_19035) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19040) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19039) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19041) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19042) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_status~0#1.base| v_ArrVal_19044) |c_ULTIMATE.start_main_~#__CS_cp___CS_thread_lockedon~0#1.base| v_ArrVal_19043) |c_~#__CS_thread_status~0.base| v_ArrVal_19060) |c_~#__CS_thread_lockedon~0.base| v_ArrVal_19048))) (store .cse0 |c_~#num~0.base| (store (select .cse0 |c_~#num~0.base|) (+ |~#num~0.offset| 4) (select (select .cse0 |c_ULTIMATE.start_main_~#__CS_cp_num~0#1.base|) (+ |ULTIMATE.start_main_~#__CS_cp_num~0#1.offset| 4))))) |c_~#m~0.base| v_ArrVal_19066) |c_~#empty~0.base| v_ArrVal_19063) |c_~#full~0.base| v_ArrVal_19054) |c_~#__CS_thread_born_round~0.base| v_ArrVal_19051) |c_~#__CS_thread_status~0.base| v_ArrVal_19062) |c_~#__CS_thread_allocated~0.base|) (+ 2 |c_~#__CS_thread_allocated~0.offset|)) 256) 1))) is different from false [2022-07-21 06:22:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 852 trivial. 47 not checked. [2022-07-21 06:22:21,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554067912] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:22:21,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:22:21,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 15] total 33 [2022-07-21 06:22:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884168016] [2022-07-21 06:22:21,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:22:21,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 06:22:21,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:22:21,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 06:22:21,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=454, Unknown=10, NotChecked=468, Total=1056 [2022-07-21 06:22:21,468 INFO L87 Difference]: Start difference. First operand 1440 states and 2257 transitions. Second operand has 33 states, 33 states have (on average 5.393939393939394) internal successors, (178), 29 states have internal predecessors, (178), 9 states have call successors, (53), 9 states have call predecessors, (53), 6 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) [2022-07-21 06:22:23,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:22:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:25,965 INFO L93 Difference]: Finished difference Result 2292 states and 3433 transitions. [2022-07-21 06:22:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 06:22:25,966 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.393939393939394) internal successors, (178), 29 states have internal predecessors, (178), 9 states have call successors, (53), 9 states have call predecessors, (53), 6 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) Word has length 221 [2022-07-21 06:22:25,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:25,978 INFO L225 Difference]: With dead ends: 2292 [2022-07-21 06:22:25,978 INFO L226 Difference]: Without dead ends: 1626 [2022-07-21 06:22:25,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 486 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=276, Invalid=1082, Unknown=10, NotChecked=702, Total=2070 [2022-07-21 06:22:25,984 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 453 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 354 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 5006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3177 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:25,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1125 Invalid, 5006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1474 Invalid, 1 Unknown, 3177 Unchecked, 3.6s Time] [2022-07-21 06:22:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2022-07-21 06:22:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1552. [2022-07-21 06:22:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1074 states have (on average 1.266294227188082) internal successors, (1360), 986 states have internal predecessors, (1360), 353 states have call successors, (353), 69 states have call predecessors, (353), 124 states have return successors, (693), 496 states have call predecessors, (693), 353 states have call successors, (693) [2022-07-21 06:22:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2406 transitions. [2022-07-21 06:22:26,138 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2406 transitions. Word has length 221 [2022-07-21 06:22:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:26,139 INFO L495 AbstractCegarLoop]: Abstraction has 1552 states and 2406 transitions. [2022-07-21 06:22:26,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.393939393939394) internal successors, (178), 29 states have internal predecessors, (178), 9 states have call successors, (53), 9 states have call predecessors, (53), 6 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) [2022-07-21 06:22:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2406 transitions. [2022-07-21 06:22:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-21 06:22:26,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:26,147 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 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] [2022-07-21 06:22:26,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:26,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:22:26,375 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash 857070716, now seen corresponding path program 1 times [2022-07-21 06:22:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:22:26,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467568689] [2022-07-21 06:22:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:22:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:22:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:22:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 06:22:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:22:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:22:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:22:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 06:22:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 06:22:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 06:22:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 06:22:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 06:22:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 06:22:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-21 06:22:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 06:22:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 06:22:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 06:22:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-21 06:22:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 06:22:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-21 06:22:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2022-07-21 06:22:56,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:22:56,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467568689] [2022-07-21 06:22:56,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467568689] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:22:56,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931378321] [2022-07-21 06:22:56,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:56,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:22:56,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:22:56,010 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:22:56,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 06:22:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:57,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 06:22:57,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:57,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 06:22:57,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 06:22:57,437 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-21 06:22:57,440 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-21 06:22:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2022-07-21 06:22:57,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 06:22:57,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931378321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 06:22:57,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 06:22:57,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [21] total 23 [2022-07-21 06:22:57,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080986459] [2022-07-21 06:22:57,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 06:22:57,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 06:22:57,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:22:57,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 06:22:57,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2022-07-21 06:22:57,490 INFO L87 Difference]: Start difference. First operand 1552 states and 2406 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-21 06:22:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:22:57,784 INFO L93 Difference]: Finished difference Result 3135 states and 4822 transitions. [2022-07-21 06:22:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 06:22:57,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 222 [2022-07-21 06:22:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:22:57,803 INFO L225 Difference]: With dead ends: 3135 [2022-07-21 06:22:57,803 INFO L226 Difference]: Without dead ends: 1600 [2022-07-21 06:22:57,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-07-21 06:22:57,814 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 337 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 06:22:57,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 902 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 06:22:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-07-21 06:22:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1531. [2022-07-21 06:22:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1059 states have (on average 1.267233238904627) internal successors, (1342), 972 states have internal predecessors, (1342), 350 states have call successors, (350), 67 states have call predecessors, (350), 121 states have return successors, (685), 491 states have call predecessors, (685), 350 states have call successors, (685) [2022-07-21 06:22:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2377 transitions. [2022-07-21 06:22:57,973 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2377 transitions. Word has length 222 [2022-07-21 06:22:57,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:22:57,974 INFO L495 AbstractCegarLoop]: Abstraction has 1531 states and 2377 transitions. [2022-07-21 06:22:57,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2022-07-21 06:22:57,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2377 transitions. [2022-07-21 06:22:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-21 06:22:57,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:22:57,981 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-21 06:22:58,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 06:22:58,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 06:22:58,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:22:58,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:22:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2138421081, now seen corresponding path program 1 times [2022-07-21 06:22:58,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:22:58,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360056142] [2022-07-21 06:22:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:58,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:22:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:22:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:22:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 06:22:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:22:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:22:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:22:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 06:22:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 06:22:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 06:22:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:22:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:22:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 06:22:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 06:22:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 06:22:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 06:22:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 06:22:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 06:22:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 06:22:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-21 06:22:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 06:22:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-21 06:22:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2022-07-21 06:22:58,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:22:58,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360056142] [2022-07-21 06:22:58,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360056142] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:22:58,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103779357] [2022-07-21 06:22:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:22:58,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:22:58,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:22:58,600 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:22:58,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 06:22:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:22:59,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 06:22:59,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:22:59,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-21 06:22:59,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-21 06:23:00,059 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 11 treesize of output 7 [2022-07-21 06:23:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 400 proven. 5 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-07-21 06:23:00,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 06:23:00,146 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 12 treesize of output 8 [2022-07-21 06:23:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 899 trivial. 0 not checked. [2022-07-21 06:23:00,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103779357] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 06:23:00,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 06:23:00,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-21 06:23:00,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872887186] [2022-07-21 06:23:00,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 06:23:00,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 06:23:00,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 06:23:00,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 06:23:00,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-21 06:23:00,305 INFO L87 Difference]: Start difference. First operand 1531 states and 2377 transitions. Second operand has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 10 states have internal predecessors, (129), 10 states have call successors, (43), 8 states have call predecessors, (43), 7 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) [2022-07-21 06:23:02,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 06:23:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 06:23:04,457 INFO L93 Difference]: Finished difference Result 3088 states and 4719 transitions. [2022-07-21 06:23:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 06:23:04,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 10 states have internal predecessors, (129), 10 states have call successors, (43), 8 states have call predecessors, (43), 7 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) Word has length 221 [2022-07-21 06:23:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 06:23:04,472 INFO L225 Difference]: With dead ends: 3088 [2022-07-21 06:23:04,472 INFO L226 Difference]: Without dead ends: 1446 [2022-07-21 06:23:04,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2022-07-21 06:23:04,483 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 1140 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 1139 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1139 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-21 06:23:04,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 1261 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1139 Valid, 1549 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-07-21 06:23:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2022-07-21 06:23:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1330. [2022-07-21 06:23:04,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 925 states have (on average 1.2540540540540541) internal successors, (1160), 856 states have internal predecessors, (1160), 293 states have call successors, (293), 64 states have call predecessors, (293), 111 states have return successors, (539), 409 states have call predecessors, (539), 293 states have call successors, (539) [2022-07-21 06:23:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1992 transitions. [2022-07-21 06:23:04,691 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1992 transitions. Word has length 221 [2022-07-21 06:23:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 06:23:04,691 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1992 transitions. [2022-07-21 06:23:04,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 10 states have internal predecessors, (129), 10 states have call successors, (43), 8 states have call predecessors, (43), 7 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) [2022-07-21 06:23:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1992 transitions. [2022-07-21 06:23:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-21 06:23:04,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 06:23:04,697 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-21 06:23:04,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-21 06:23:04,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 06:23:04,912 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 06:23:04,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 06:23:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1032257057, now seen corresponding path program 1 times [2022-07-21 06:23:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 06:23:04,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3314653] [2022-07-21 06:23:04,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:23:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 06:23:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:35,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 06:23:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 06:23:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:35,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:23:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:35,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:23:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:35,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 06:23:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:35,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 06:23:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:23:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:23:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 06:23:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 06:23:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:23:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:23:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 06:23:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:23:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:23:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 06:23:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 06:23:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 06:23:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 06:23:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 06:23:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 06:23:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 06:23:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 06:23:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 06:23:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 06:23:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 06:23:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-21 06:23:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 06:23:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-21 06:23:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2022-07-21 06:23:36,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 06:23:36,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3314653] [2022-07-21 06:23:36,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3314653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 06:23:36,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964159045] [2022-07-21 06:23:36,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 06:23:36,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 06:23:36,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 06:23:36,148 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 06:23:36,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 06:23:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 06:23:37,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 127 conjunts are in the unsatisfiable core [2022-07-21 06:23:37,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 06:23:38,036 INFO L356 Elim1Store]: treesize reduction 64, result has 47.1 percent of original size [2022-07-21 06:23:38,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 92 [2022-07-21 06:23:39,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 06:23:39,117 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-07-21 06:23:39,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 128 [2022-07-21 06:23:39,166 INFO L356 Elim1Store]: treesize reduction 63, result has 22.2 percent of original size [2022-07-21 06:23:39,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 155 [2022-07-21 06:23:39,230 INFO L356 Elim1Store]: treesize reduction 129, result has 12.2 percent of original size [2022-07-21 06:23:39,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 183 [2022-07-21 06:23:39,319 INFO L356 Elim1Store]: treesize reduction 256, result has 7.6 percent of original size [2022-07-21 06:23:39,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 179 treesize of output 234 [2022-07-21 06:23:39,415 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2022-07-21 06:23:39,449 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2022-07-21 06:23:40,384 INFO L356 Elim1Store]: treesize reduction 68, result has 11.7 percent of original size [2022-07-21 06:23:40,385 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 57 [2022-07-21 06:23:41,106 INFO L356 Elim1Store]: treesize reduction 80, result has 10.1 percent of original size [2022-07-21 06:23:41,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 61 [2022-07-21 06:23:41,182 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 13 treesize of output 9 [2022-07-21 06:23:41,246 INFO L356 Elim1Store]: treesize reduction 80, result has 10.1 percent of original size [2022-07-21 06:23:41,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 61 [2022-07-21 06:23:41,323 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 13 treesize of output 9 [2022-07-21 06:23:41,394 INFO L356 Elim1Store]: treesize reduction 80, result has 10.1 percent of original size [2022-07-21 06:23:41,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 61 [2022-07-21 06:23:41,472 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 13 treesize of output 9 [2022-07-21 06:23:41,530 INFO L356 Elim1Store]: treesize reduction 80, result has 10.1 percent of original size [2022-07-21 06:23:41,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 61 [2022-07-21 06:23:41,610 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 13 treesize of output 9 [2022-07-21 06:23:41,676 INFO L356 Elim1Store]: treesize reduction 80, result has 10.1 percent of original size [2022-07-21 06:23:41,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 61 [2022-07-21 06:23:41,762 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 13 treesize of output 9 [2022-07-21 06:23:41,825 INFO L356 Elim1Store]: treesize reduction 71, result has 20.2 percent of original size [2022-07-21 06:23:41,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 69 [2022-07-21 06:23:43,673 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 06:23:43,688 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 06:23:43,711 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 06:23:43,725 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 06:23:43,740 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 06:23:43,788 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 06:24:11,684 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-07-21 06:24:11,684 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 46 treesize of output 47 [2022-07-21 06:24:11,796 INFO L356 Elim1Store]: treesize reduction 152, result has 11.1 percent of original size [2022-07-21 06:24:11,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 150 [2022-07-21 06:24:12,030 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-07-21 06:24:12,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-07-21 06:24:12,146 INFO L356 Elim1Store]: treesize reduction 152, result has 11.1 percent of original size [2022-07-21 06:24:12,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 150 [2022-07-21 06:24:12,418 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-07-21 06:24:12,418 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 46 treesize of output 47 [2022-07-21 06:24:12,547 INFO L356 Elim1Store]: treesize reduction 144, result has 15.8 percent of original size [2022-07-21 06:24:12,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 158 [2022-07-21 06:24:13,140 INFO L356 Elim1Store]: treesize reduction 144, result has 15.8 percent of original size [2022-07-21 06:24:13,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 158 [2022-07-21 06:24:13,619 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-07-21 06:24:13,620 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 46 treesize of output 47 [2022-07-21 06:24:13,786 INFO L356 Elim1Store]: treesize reduction 152, result has 11.1 percent of original size [2022-07-21 06:24:13,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 150 [2022-07-21 06:24:14,179 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-07-21 06:24:14,180 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 46 treesize of output 47 [2022-07-21 06:24:14,323 INFO L356 Elim1Store]: treesize reduction 152, result has 11.1 percent of original size [2022-07-21 06:24:14,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 150 [2022-07-21 06:24:16,344 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-07-21 06:24:16,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 178 [2022-07-21 06:24:17,096 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 33 treesize of output 23 [2022-07-21 06:24:18,016 INFO L356 Elim1Store]: treesize reduction 83, result has 24.5 percent of original size [2022-07-21 06:24:18,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 192 [2022-07-21 06:24:18,373 INFO L356 Elim1Store]: treesize reduction 131, result has 13.2 percent of original size [2022-07-21 06:24:18,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 67